class Solution {
public:
    int findMin(vector<int>& nums) {
        int num = nums[nums.size()-1];
        int left=0;
        int right=nums.size()-1;
        while(left<right)
        {
            int mid = left+(right-left)/2;
            if(num<nums[mid])
                left = mid+1;
            else
                right = mid;
        }
        return nums[left];
    }
};
